Compressing Propositional Refutations Using Subsumption
نویسنده
چکیده
We describe ongoing work on the use of subsumption to remove redundant inferences from propositional resolution refutation proofs of the style generated by conflict driven clause learning SAT solvers. This is used for faster LCF-style proof replay in interactive theorem provers. There may also be an application in the extraction of small unsatisfiable cores.
منابع مشابه
Compressing Propositional Refutations
We report initial results on shortening propositional resolution refutation proofs. This has an application in speeding up deductive reconstruction (in theorem provers) of large propositional refutations, such as those produced by SAT-solvers.
متن کاملAverage-Case Separation in Proof Complexity: Short Propositional Refutations for Random 3CNF Formulas
Separating different propositional proof systems—that is, demonstrating that one proof system cannot efficiently simulate another proof system—is one of the main goals of proof complexity. Nevertheless, all known separation results between non-abstract proof systems are for specific families of hard tautologies: for what we know, in the average case all (non-abstract) propositional proof system...
متن کاملProof Complexity of Relativized Statements
The first-order formulas that do not have finite models give rise to uniform families of propositional unsatisfiable formulas, one for each finite cardinality. Motivated by the question of characterizing the class of such formulas whose propositional translations have short resolution refutations, we study their closure properties. Our starting point is the observation that the class of relativ...
متن کاملGood Degree Bounds on Nullstellensatz Refutations of the Induction Principle
This paper gives nearly optimal, logarithmic upper and lower bounds on the minimum degree of Nullstellensatz refutations (i.e., polynomials) of the propositional induction principle.
متن کاملComparing Subsumption Optimizations
Effective systems for expressive description logics require a heavily-optimised subsumption checker incorporating a range of optimisation techniques. Because of the correspondence between description logics and propositional modal logic most of these techniques carry over into propositional modal logic satisfiability checking. Some of the techniques are extremely effective on various test suite...
متن کامل